Papers with machine reading
Crowd-sourcing annotation of complex NLU tasks: A case study of argumentative content annotation (D19-59)
Copied to clipboard
| Challenge: | Recent advances in machine reading and listening comprehension involve the annotation of long texts. |
| Approach: | They propose a way to perform a sentence-by-sentence annotation task with crowd annotators. |
| Outcome: | The proposed approach can be used to identify claims in a debate speech. |
Training a Ranking Function for Open-Domain Question Answering (N18-4)
Copied to clipboard
| Challenge: | Recent advances in machine reading have inspired researchers to combine Information Retrieval with machine reading to tackle open-domain QA. |
| Approach: | They propose two neural network rankers that assign scores to different passages based on their likelihood of containing the answer to a given question. |
| Outcome: | The proposed models achieve human level performance in open-domain QA compared to reading comprehension-style QA because it is difficult to retrieve the pieces of paragraphs that contain the answer to the question. |
Recurrent Entity Networks with Delayed Memory Update for Targeted Aspect-Based Sentiment Analysis (N18-2)
Copied to clipboard
| Challenge: | Recent work on target-dependent biLSTMs has shown that they are ineffective in aspect-based sentiment analysis. |
| Approach: | They propose a novel architecture that uses external memory chains with a delayed memory update mechanism to track entities. |
| Outcome: | The proposed model improves on a TABSA task using external memory chains with a delayed memory update mechanism. |
Read before Generate! Faithful Long Form Question Answering with Machine Reading (2022.findings-acl)
Copied to clipboard
| Challenge: | Long-form question answering (LFQA) generates a paragraph-length answer for a given question. |
| Approach: | They propose a framework that jointly models answer generation and machine reading. |
| Outcome: | The proposed model generates a more factually accurate answer from millions of documents retrieved from a large dataset. |
Towards End-to-End Open Conversational Machine Reading (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing approaches to the problem of open-retrieval conversational machine reading (OR-CMR) use two separate modules to approach the problem's two successive sub-tasks. |
| Approach: | They propose to model OR-CMR as a unified text-to-text task in a fully end-to end style and propose to use a text-based approach to solve the problem. |
| Outcome: | Experiments on the ShARC and OR-ShARC dataset show that the proposed framework can generalize to different backbone models. |
Online Distilling from Checkpoints for Neural Machine Translation (N19-1)
Copied to clipboard
| Challenge: | Existing neural machine translation models have a deep structure with large amounts of parameters, making them hard to train. |
| Approach: | They propose an online method to generate a teacher model from checkpoints . they show steady improvement over a strong self-attention-based baseline system . |
| Outcome: | The proposed method improves on-the-fly on several datasets and language pairs. |
When Do Decompositions Help for Machine Reading? (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on decompositions of complex questions has focused on multi-step reasoning . but, in machine reading, it is unclear when decomposing is helpful . |
| Approach: | They conduct experiments on decompositions in machine reading to unify recent work . they find that decomposing complex questions can be helpful in zero or limited-data settings . |
| Outcome: | The proposed model can learn decompositions implicitly even with limited data, the study shows . the results are consistent with previous work on decomposing complex questions . |
Interpretation of Natural Language Rules in Conversational Machine Reading (D18-1)
Copied to clipboard
Marzieh Saeidi, Max Bartolo, Patrick Lewis, Sameer Singh, Tim Rocktäschel, Mike Sheldon, Guillaume Bouchard, Sebastian Riedel
| Challenge: | Existing work on question answering problems requires the reading of text because it contains a recipe to derive an answer together with the reader’s background knowledge. |
| Approach: | They formalise a task and develop a crowd-sourcing strategy to collect 37k task instances based on real-world rules and crowd-generated questions and scenarios. |
| Outcome: | The proposed task is based on 37k task instances based in real-world rules and crowd-generated questions and scenarios. |
Structural Scaffolds for Citation Intent Classification in Scientific Publications (N19-1)
Copied to clipboard
| Challenge: | Existing methods for identifying intent of citations are limited by external linguistic resources and hand-engineered features. |
| Approach: | They propose a multitask model to incorporate structural information of scientific papers into citations for effective classification of citation intents. |
| Outcome: | The proposed model achieves a 13.3% increase in F1 score on an existing ACL anthology dataset without external linguistic resources or hand-engineered features as done in existing methods. |
Conversing by Reading: Contentful Neural Conversation with On-demand Machine Reading (P19-1)
Copied to clipboard
Lianhui Qin, Michel Galley, Chris Brockett, Xiaodong Liu, Xiang Gao, Bill Dolan, Yejin Choi, Jianfeng Gao
| Challenge: | a new approach to contentful neural conversation is proposed . end-to-end models are effective in learning fluent responses, but their responses are often vacuous and uninformative. |
| Approach: | They propose a model that provides the conversation model with relevant text on the fly as a source of external knowledge. |
| Outcome: | The proposed model improves the informativeness and diversity of generated output compared to previous methods. |
Locke’s Holiday: Belief Bias in Machine Reading (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing machine reading systems fail to answer What did Elizabeth want? correctly in the context of ‘My kingdom for a cough drop, cried Queen Elizabeth.’ Biased by co-occurrence statistics in the training data of pretrained language models, systems predict my kingdom, rather than a lung drop. |
| Approach: | They propose to use a dataset to quantify belief bias in machine reading based on pre-trained language models to examine the pervasiveness of belief bias. |
| Outcome: | The proposed dataset shows that machine reading models fail when contexts do not align with common beliefs. |
Machine Reading of Historical Events (2020.acl-main)
Copied to clipboard
| Challenge: | Using a short text description of an event, we can extract relevant sentences from Wikipedia and apply a combination of task-specific and general-purpose feature embeddings for the classification. |
| Approach: | They propose to use Wikipedia sentences to extract relevant sentences and apply feature embeddings to the task. |
| Outcome: | The proposed model outperforms the historical event ordering task and the event focus time task in the literature. |